0.03/0.10 % Problem : SLH219^1 : TPTP v7.5.0. Released v7.5.0. 0.03/0.11 % Command : run_E %s %d THM 0.11/0.31 % Computer : n014.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 30 0.11/0.31 % WCLimit : 30 0.11/0.31 % DateTime : Tue Aug 9 02:38:31 EDT 2022 0.16/0.31 % CPUTime : 0.16/0.43 The problem SPC is TH0_THM_EQU_NAR 0.16/0.43 Running higher-order on 1 cores theorem proving 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.16/0.43 # Version: 3.0pre003-ho 0.16/0.47 # Preprocessing class: HSLSSMSMSSSNSSA. 0.16/0.47 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.47 # Starting new_ho_10_unif with 30s (1) cores 0.16/0.47 # new_ho_10_unif with pid 5476 completed with status 0 0.16/0.47 # Result found by new_ho_10_unif 0.16/0.47 # Preprocessing class: HSLSSMSMSSSNSSA. 0.16/0.47 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.47 # Starting new_ho_10_unif with 30s (1) cores 0.16/0.47 # No SInE strategy applied 0.16/0.47 # Search class: HGHSM-FSLM32-MSSFFSBN 0.16/0.47 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.47 # Starting ehoh_best8 with 17s (1) cores 0.16/0.47 # ehoh_best8 with pid 5477 completed with status 0 0.16/0.47 # Result found by ehoh_best8 0.16/0.47 # Preprocessing class: HSLSSMSMSSSNSSA. 0.16/0.47 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.47 # Starting new_ho_10_unif with 30s (1) cores 0.16/0.47 # No SInE strategy applied 0.16/0.47 # Search class: HGHSM-FSLM32-MSSFFSBN 0.16/0.47 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.47 # Starting ehoh_best8 with 17s (1) cores 0.16/0.47 # Preprocessing time : 0.007 s 0.16/0.47 # Presaturation interreduction done 0.16/0.47 0.16/0.47 # Proof found! 0.16/0.47 # SZS status Theorem 0.16/0.47 # SZS output start CNFRefutation 0.16/0.47 thf(decl_22, type, plus_plus_a: a > a > a). 0.16/0.47 thf(decl_23, type, times_times_a: a > a > a). 0.16/0.47 thf(decl_24, type, zero_zero_a: a). 0.16/0.47 thf(decl_25, type, groups1792256535list_a: list_a > a). 0.16/0.47 thf(decl_26, type, last_a: list_a > a). 0.16/0.47 thf(decl_27, type, nil_a: list_a). 0.16/0.47 thf(decl_28, type, ord_less_a: a > a > $o). 0.16/0.47 thf(decl_29, type, ord_less_eq_a: a > a > $o). 0.16/0.47 thf(decl_30, type, x: a). 0.16/0.47 thf(decl_31, type, xa: a). 0.16/0.47 thf(decl_32, type, xs: list_a). 0.16/0.47 thf(decl_33, type, xsa: list_a). 0.16/0.47 thf(decl_34, type, y: a). 0.16/0.47 thf(decl_35, type, ya: a). 0.16/0.47 thf(decl_36, type, esk1_1: a > a). 0.16/0.47 thf(decl_37, type, esk2_1: a > a). 0.16/0.47 thf(decl_38, type, esk3_1: a > a). 0.16/0.47 thf(decl_39, type, esk4_1: (a > a > $o) > a). 0.16/0.47 thf(decl_40, type, esk5_1: (a > a > $o) > a). 0.16/0.47 thf(decl_41, type, esk6_1: (a > a > $o) > a). 0.16/0.47 thf(decl_42, type, esk7_1: (a > a > $o) > a). 0.16/0.47 thf(decl_43, type, esk8_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_44, type, esk9_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_45, type, esk10_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_46, type, esk11_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_47, type, esk12_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_48, type, esk13_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_49, type, esk14_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_50, type, esk15_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_51, type, esk16_1: (a > a > $o) > a). 0.16/0.47 thf(decl_52, type, esk17_1: (a > a > $o) > a). 0.16/0.47 thf(decl_53, type, esk18_1: (a > a > $o) > a). 0.16/0.47 thf(decl_54, type, esk19_1: (a > a > $o) > a). 0.16/0.47 thf(decl_55, type, esk20_1: (a > a > $o) > a). 0.16/0.47 thf(decl_56, type, esk21_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_57, type, esk22_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_58, type, esk23_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_59, type, esk24_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_60, type, esk25_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_61, type, esk26_4: a > a > (a > a) > a > a). 0.16/0.47 thf(decl_62, type, esk27_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_63, type, esk28_4: a > (a > a) > a > a > a). 0.16/0.47 thf(decl_64, type, esk29_3: (a > $o) > (a > $o) > a > a). 0.16/0.47 thf(decl_65, type, esk30_5: (a > $o) > (a > $o) > (a > $o) > (a > $o) > a > a). 0.16/0.47 thf(decl_66, type, esk31_4: (a > $o) > (a > $o) > (a > $o) > (a > $o) > a). 0.16/0.47 thf(decl_67, type, esk32_0: a). 0.16/0.47 thf(fact_83_add_Ocommute, axiom, ((plus_plus_a)=(^[X13:a, X14:a]:(plus_plus_a @ X14 @ X13))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_83_add_Ocommute)). 0.16/0.47 thf(fact_105_mult_Ocommute, axiom, ((times_times_a)=(^[X13:a, X14:a]:(times_times_a @ X14 @ X13))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_105_mult_Ocommute)). 0.16/0.47 thf(conj_0, conjecture, ((^[X39:a]:(plus_plus_a @ X39 @ (plus_plus_a @ xa @ ya)))=(plus_plus_a @ (plus_plus_a @ xa @ ya))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.16/0.47 thf(fact_5_ab__semigroup__add__class_Oadd__ac_I1_J, axiom, ![X1:a, X2:a, X3:a]:(((plus_plus_a @ (plus_plus_a @ X1 @ X2) @ X3)=(plus_plus_a @ X1 @ (plus_plus_a @ X2 @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_ab__semigroup__add__class_Oadd__ac_I1_J)). 0.16/0.47 thf(fact_103_ab__semigroup__mult__class_Omult__ac_I1_J, axiom, ![X1:a, X2:a, X3:a]:(((times_times_a @ (times_times_a @ X1 @ X2) @ X3)=(times_times_a @ X1 @ (times_times_a @ X2 @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_103_ab__semigroup__mult__class_Omult__ac_I1_J)). 0.16/0.47 thf(c_0_5, plain, ![X624:a, X625:a]:(((plus_plus_a @ X624 @ X625)=(plus_plus_a @ X625 @ X624))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_83_add_Ocommute])])). 0.16/0.47 thf(c_0_6, plain, ![X626:a, X627:a]:(((times_times_a @ X626 @ X627)=(times_times_a @ X627 @ X626))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_105_mult_Ocommute])])). 0.16/0.47 thf(c_0_7, negated_conjecture, ~(![X635:a]:(((plus_plus_a @ X635 @ (plus_plus_a @ xa @ ya))=(plus_plus_a @ (plus_plus_a @ xa @ ya) @ X635)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])])). 0.16/0.47 thf(c_0_8, plain, ![X836:a, X837:a]:(((plus_plus_a @ X836 @ X837)=(plus_plus_a @ X837 @ X836))), inference(variable_rename,[status(thm)],[c_0_5])). 0.16/0.47 thf(c_0_9, plain, ![X872:a, X873:a]:(((times_times_a @ X872 @ X873)=(times_times_a @ X873 @ X872))), inference(variable_rename,[status(thm)],[c_0_6])). 0.16/0.47 thf(c_0_10, plain, ![X642:a, X643:a, X644:a]:(((plus_plus_a @ (plus_plus_a @ X642 @ X643) @ X644)=(plus_plus_a @ X642 @ (plus_plus_a @ X643 @ X644)))), inference(variable_rename,[status(thm)],[fact_5_ab__semigroup__add__class_Oadd__ac_I1_J])). 0.16/0.47 thf(c_0_11, plain, ![X866:a, X867:a, X868:a]:(((times_times_a @ (times_times_a @ X866 @ X867) @ X868)=(times_times_a @ X866 @ (times_times_a @ X867 @ X868)))), inference(variable_rename,[status(thm)],[fact_103_ab__semigroup__mult__class_Omult__ac_I1_J])). 0.16/0.47 thf(c_0_12, negated_conjecture, ((plus_plus_a @ esk32_0 @ (plus_plus_a @ xa @ ya))!=(plus_plus_a @ (plus_plus_a @ xa @ ya) @ esk32_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 0.16/0.47 thf(c_0_13, plain, ![X2:a, X1:a]:(((plus_plus_a @ X1 @ X2)=(plus_plus_a @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.16/0.47 thf(c_0_14, plain, ![X2:a, X1:a]:(((times_times_a @ X1 @ X2)=(times_times_a @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.16/0.47 thf(c_0_15, plain, ![X1:a, X2:a, X3:a]:(((plus_plus_a @ (plus_plus_a @ X1 @ X2) @ X3)=(plus_plus_a @ X1 @ (plus_plus_a @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.16/0.47 thf(c_0_16, plain, ![X1:a, X2:a, X3:a]:(((times_times_a @ (times_times_a @ X1 @ X2) @ X3)=(times_times_a @ X1 @ (times_times_a @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.16/0.47 thf(c_0_17, negated_conjecture, ((plus_plus_a @ esk32_0 @ (plus_plus_a @ xa @ ya))!=(plus_plus_a @ (plus_plus_a @ xa @ ya) @ esk32_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.16/0.47 thf(c_0_18, plain, ![X2:a, X1:a]:(((plus_plus_a @ X1 @ X2)=(plus_plus_a @ X2 @ X1))), c_0_13). 0.16/0.47 thf(c_0_19, plain, ![X2:a, X1:a]:(((times_times_a @ X1 @ X2)=(times_times_a @ X2 @ X1))), c_0_14). 0.16/0.47 thf(c_0_20, plain, ![X1:a, X2:a, X3:a]:(((plus_plus_a @ (plus_plus_a @ X1 @ X2) @ X3)=(plus_plus_a @ X1 @ (plus_plus_a @ X2 @ X3)))), c_0_15). 0.16/0.47 thf(c_0_21, plain, ![X1:a, X2:a, X3:a]:(((times_times_a @ (times_times_a @ X1 @ X2) @ X3)=(times_times_a @ X1 @ (times_times_a @ X2 @ X3)))), c_0_16). 0.16/0.47 thf(c_0_22, negated_conjecture, ($false), inference(ar,[status(thm)],[c_0_17, c_0_18, c_0_19, c_0_20, c_0_21]), ['proof']). 0.16/0.47 # SZS output end CNFRefutation 0.16/0.47 # Parsed axioms : 247 0.16/0.47 # Removed by relevancy pruning/SinE : 0 0.16/0.47 # Initial clauses : 472 0.16/0.47 # Removed in clause preprocessing : 35 0.16/0.47 # Initial clauses in saturation : 437 0.16/0.47 # Processed clauses : 2 0.16/0.47 # ...of these trivial : 0 0.16/0.47 # ...subsumed : 0 0.16/0.47 # ...remaining for further processing : 1 0.16/0.47 # Other redundant clauses eliminated : 0 0.16/0.47 # Clauses deleted for lack of memory : 0 0.16/0.47 # Backward-subsumed : 0 0.16/0.47 # Backward-rewritten : 0 0.16/0.47 # Generated clauses : 0 0.16/0.47 # ...of the previous two non-redundant : 0 0.16/0.47 # ...aggressively subsumed : 0 0.16/0.47 # Contextual simplify-reflections : 0 0.16/0.47 # Paramodulations : 0 0.16/0.47 # Factorizations : 0 0.16/0.47 # NegExts : 0 0.16/0.47 # Equation resolutions : 0 0.16/0.47 # Propositional unsat checks : 0 0.16/0.47 # Propositional check models : 0 0.16/0.47 # Propositional check unsatisfiable : 0 0.16/0.47 # Propositional clauses : 0 0.16/0.47 # Propositional clauses after purity: 0 0.16/0.47 # Propositional unsat core size : 0 0.16/0.47 # Propositional preprocessing time : 0.000 0.16/0.47 # Propositional encoding time : 0.000 0.16/0.47 # Propositional solver time : 0.000 0.16/0.47 # Success case prop preproc time : 0.000 0.16/0.47 # Success case prop encoding time : 0.000 0.16/0.47 # Success case prop solver time : 0.000 0.16/0.47 # Current number of processed clauses : 1 0.16/0.47 # Positive orientable unit clauses : 0 0.16/0.47 # Positive unorientable unit clauses: 0 0.16/0.47 # Negative unit clauses : 1 0.16/0.47 # Non-unit-clauses : 0 0.16/0.47 # Current number of unprocessed clauses: 435 0.16/0.47 # ...number of literals in the above : 1412 0.16/0.47 # Current number of archived formulas : 0 0.16/0.47 # Current number of archived clauses : 0 0.16/0.47 # Clause-clause subsumption calls (NU) : 0 0.16/0.47 # Rec. Clause-clause subsumption calls : 0 0.16/0.47 # Non-unit clause-clause subsumptions : 0 0.16/0.47 # Unit Clause-clause subsumption calls : 0 0.16/0.47 # Rewrite failures with RHS unbound : 0 0.16/0.47 # BW rewrite match attempts : 0 0.16/0.47 # BW rewrite match successes : 0 0.16/0.47 # Condensation attempts : 0 0.16/0.47 # Condensation successes : 0 0.16/0.47 # Termbank termtop insertions : 29428 0.16/0.47 0.16/0.47 # ------------------------------------------------- 0.16/0.47 # User time : 0.021 s 0.16/0.47 # System time : 0.008 s 0.16/0.47 # Total time : 0.029 s 0.16/0.47 # Maximum resident set size: 3412 pages 0.16/0.47 0.16/0.47 # ------------------------------------------------- 0.16/0.47 # User time : 0.028 s 0.16/0.47 # System time : 0.010 s 0.16/0.47 # Total time : 0.038 s 0.16/0.47 # Maximum resident set size: 1884 pages 0.16/0.47 EOF